0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : run_vampire %s %d
0.13/0.34	% Computer   : n014.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 12:29:19 EDT 2021
0.13/0.35	% CPUTime    : 
0.20/0.35	This is a THF_ problem
0.20/0.35	Running vampire --ignore_missing on --mode casc_hol --cores 0 -t 120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.35	Running in auto input_syntax mode. Trying TPTP
0.20/0.40	% (11334)dis+1002_3:1_acc=model:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afr=on:afp=40000:afq=1.1:anc=none:ccuc=first:fsr=off:gsp=input_only:irw=on:nm=16:nwc=1:sos=all:thsq=on_8 on theBenchmark
0.20/0.40	% (11323)dis+1010_3:2_av=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:gsp=input_only:nm=2:nwc=1:sp=reverse_arity:urr=ec_only:thsq=on_29 on theBenchmark
0.20/0.40	% (11323)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.40	% (11322)lrs+4_3_av=off:br=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on:thsq=on_32 on theBenchmark
0.20/0.40	% (11320)ott+1002_8:1_add=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afr=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:bs=unit_only:fsr=off:gs=on:gsem=off:nm=32:nwc=10:sp=occurrence:urr=on:updr=off:thsq=on_14 on theBenchmark
0.20/0.40	% (11324)dis+1_2:3_acc=on:add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=40000:afq=2.0:amm=sco:anc=none:er=filter:fsr=off:gsp=input_only:gs=on:gsem=off:nm=64:newcnf=on:nwc=1:thsq=on_3 on theBenchmark
0.20/0.40	% (11322)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.40	% (11324)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.40	% (11324)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.40	% (11342)lrs-11_4:1_afp=4000:csup=on:inj=on:mXXn=1:cases=on:e2e=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_186 on theBenchmark
0.20/0.41	% (11334)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.41	% (11326)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on:thsq=on_2 on theBenchmark
0.20/0.41	% (11316)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_2 on theBenchmark
0.20/0.41	% (11318)dis+10_128_acc=on:add=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on:thsq=on_2 on theBenchmark
0.20/0.41	% (11315)ott+1002_2_av=off:bd=preordered:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:irw=on:lma=on:nm=64:nwc=10:sp=reverse_arity:updr=off:thsq=on_2 on theBenchmark
0.20/0.41	% (11319)lrs+1010_8_add=off:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on:thsq=on_13 on theBenchmark
0.20/0.42	% (11317)lrs+1011_8_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=100000:afq=1.1:er=filter:gsp=input_only:gs=on:gsem=on:lma=on:nm=6:nwc=1:stl=30:sd=2:ss=axioms:st=1.5:sos=on:thsq=on_3 on theBenchmark
0.20/0.42	% (11318)Refutation not found, incomplete strategy% (11318)------------------------------
0.20/0.42	% (11318)Version: Vampire 4.6.0 (commit 0afb7ed4a on 2021-06-23 15:27:21 +0100)
0.20/0.42	% (11318)Termination reason: Refutation not found, incomplete strategy
0.20/0.42	
0.20/0.42	% (11318)Memory used [KB]: 10362
0.20/0.42	% (11318)Time elapsed: 0.049 s
0.20/0.42	% (11318)------------------------------
0.20/0.42	% (11318)------------------------------
0.20/0.42	% (11319)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.42	% (11337)dis+10_4_av=off:bsr=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:cond=fast:er=filter:fde=none:gsp=input_only:lcm=reverse:lma=on:nwc=4:sp=occurrence:urr=on:thsq=on_8 on theBenchmark
0.20/0.42	% (11317)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.42	% (11344)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:e2e=on:prag=on:cases=on:cnfonf=eager:afq=1.0:fde=all:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on:thsq=on_50 on theBenchmark
0.20/0.42	% (11329)lrs+1002_1_av=off:er=filter:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:fsr=off:gs=on:gsem=off:irw=on:lma=on:nm=4:nwc=1:stl=30:sd=3:ss=axioms:st=1.5:sos=on:thsq=on_1 on theBenchmark
0.20/0.42	% (11337)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.42	% (11343)dis+1002_4_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=40000:afq=1.0:anc=none:cond=fast:fde=none:gs=on:gsaa=full_model:lma=on:lwlo=on:nm=0:nwc=1.5:sp=reverse_arity:tha=off_300 on theBenchmark
0.20/0.43	% (11324)First to succeed.
0.20/0.43	% (11333)ott+11_20_afr=on:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=sco:anc=all:bsr=on:irw=on:lma=on:nm=4:nwc=1.2:sac=on:sp=occurrence:thsq=on_6 on theBenchmark
0.20/0.43	% (11335)lrs+10_12_add=off:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.4:amm=sco:anc=none:cond=on:lma=on:nm=64:nwc=1.3:stl=30:sac=on:urr=on:thsq=on_41 on theBenchmark
0.20/0.44	% (11321)lrs+1011_5:1_acc=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off:thsq=on_3 on theBenchmark
0.20/0.44	% (11336)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:cases=on:cnfonf=lazy_gen:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_30 on theBenchmark
0.20/0.44	% (11325)dis+10_128_acc=on:add=off:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on:thsq=on_40 on theBenchmark
0.20/0.44	% (11340)lrs+1010_8_add=off:afp=100000:csup=on:inj=off:cases=on:chr=off:e2e=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on:thsq=on_13 on theBenchmark
0.20/0.44	% (11341)lrs+1_4_afp=100000:afq=1.2:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:anc=none:bd=off:cond=on:gs=on:gsem=off:nm=64:nwc=1:sd=2:ss=axioms:st=2.0:sos=all:updr=off:thsq=on_300 on theBenchmark
0.20/0.44	% (11340)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.44	% (11328)lrs+1010_3_av=off:fsr=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:gs=on:gsem=off:nm=2:newcnf=on:nwc=2:stl=30:sp=reverse_arity:urr=on:updr=off:thsq=on_9 on theBenchmark
0.20/0.44	% (11328)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.45	% (11332)lrs+1011_5:1_acc=on:csup=on:inj=on:e2e=on:prag=on:cases=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off:thsq=on_30 on theBenchmark
0.20/0.45	% (11332)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.45	% (11324)Refutation found. Thanks to Tanya!
0.20/0.45	% SZS status Theorem for theBenchmark
0.20/0.45	% SZS output start Proof for theBenchmark
0.20/0.45	thf(type_def_6, type, >: ($tType * $tType) > $tType).
0.20/0.45	thf(func_def_7, type, eps: ($i > $o) > $i).
0.20/0.45	thf(func_def_8, type, epsio: (($i > $o) > $o) > $i > $o).
0.20/0.45	thf(func_def_9, type, setunion: (($i > $o) > $o) > $i > $o).
0.20/0.45	thf(func_def_11, type, choosenonempty: (($i > $o) > $o) > $i > $o).
0.20/0.45	thf(func_def_12, type, c: ($i > $o) > $o).
0.20/0.45	thf(func_def_14, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
0.20/0.45	thf(func_def_17, type, vAND: $o > $o > $o).
0.20/0.45	thf(func_def_18, type, vSIGMA: !>[X0: $tType]:((X0 > $o) > $o)).
0.20/0.45	thf(func_def_19, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
0.20/0.45	thf(func_def_20, type, iCOMB: !>[X0: $tType]:(X0 > X0)).
0.20/0.45	thf(func_def_21, type, cCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > X1 > X0 > X2)).
0.20/0.45	thf(func_def_22, type, sCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > (X0 > X1) > X0 > X2)).
0.20/0.45	thf(func_def_24, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
0.20/0.45	thf(func_def_25, type, vOR: $o > $o > $o).
0.20/0.45	thf(func_def_26, type, vIMP: $o > $o > $o).
0.20/0.45	thf(func_def_27, type, vNOT: $o > $o).
0.20/0.45	thf(func_def_28, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
0.20/0.45	thf(func_def_29, type, sK1: $i > $o).
0.20/0.45	thf(f176,plain,(
0.20/0.45	  $false),
0.20/0.45	  inference(avatar_sat_refutation,[],[f50,f55,f60,f109,f115,f131,f160,f171])).
0.20/0.45	thf(f171,plain,(
0.20/0.45	  ~spl0_3 | ~spl0_6),
0.20/0.45	  inference(avatar_contradiction_clause,[],[f170])).
0.20/0.45	thf(f170,plain,(
0.20/0.45	  $false | (~spl0_3 | ~spl0_6)),
0.20/0.45	  inference(trivial_inequality_removal,[],[f169])).
0.20/0.45	thf(f169,plain,(
0.20/0.45	  ($true != $true) | (~spl0_3 | ~spl0_6)),
0.20/0.45	  inference(superposition,[],[f49,f71])).
0.20/0.45	thf(f71,plain,(
0.20/0.45	  ($true = ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))) | ~spl0_6),
0.20/0.45	  inference(avatar_component_clause,[],[f69])).
0.20/0.45	thf(f69,plain,(
0.20/0.45	  spl0_6 <=> ($true = ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_6])])).
0.20/0.45	thf(f49,plain,(
0.20/0.45	  ( ! [X0 : $i] : (($true != ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ X0))) ) | ~spl0_3),
0.20/0.45	  inference(avatar_component_clause,[],[f48])).
0.20/0.45	thf(f48,plain,(
0.20/0.45	  spl0_3 <=> ! [X0] : ($true != ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ X0))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
0.20/0.45	thf(f160,plain,(
0.20/0.45	  spl0_6 | spl0_7),
0.20/0.45	  inference(avatar_split_clause,[],[f158,f73,f69])).
0.20/0.45	thf(f73,plain,(
0.20/0.45	  spl0_7 <=> ! [X1 : $i > $o] : (($false = (X1 @ (eps @ X1))) | ($false = (c @ X1)))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_7])])).
0.20/0.45	thf(f158,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (X1 @ (eps @ X1))) | ($true = ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))) | ($false = (c @ X1))) )),
0.20/0.45	  inference(binary_proxy_clausification,[],[f157])).
0.20/0.45	thf(f157,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (X1 @ (eps @ X1))) | ($true = ((vAND @ (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))) @ ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))))) | ($false = (c @ X1))) )),
0.20/0.45	  inference(binary_proxy_clausification,[],[f156])).
0.20/0.45	thf(f156,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = ((vAND @ (c @ X1)) @ (X1 @ (eps @ X1)))) | ($true = ((vAND @ (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))) @ ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))))) )),
0.20/0.45	  inference(combinator_demodulation,[],[f151])).
0.20/0.45	thf(f151,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)) @ X1)) | ($true = (((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)) @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))) )),
0.20/0.45	  introduced(choice_axiom,[])).
0.20/0.45	thf(f131,plain,(
0.20/0.45	  spl0_2 | spl0_7),
0.20/0.45	  inference(avatar_split_clause,[],[f129,f73,f44])).
0.20/0.45	thf(f44,plain,(
0.20/0.45	  spl0_2 <=> ($true = (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
0.20/0.45	thf(f129,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (X1 @ (eps @ X1))) | ($true = (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))) | ($false = (c @ X1))) )),
0.20/0.45	  inference(binary_proxy_clausification,[],[f127])).
0.20/0.45	thf(f127,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (X1 @ (eps @ X1))) | ($true = ((vAND @ (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))) @ ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))))) | ($false = (c @ X1))) )),
0.20/0.45	  inference(binary_proxy_clausification,[],[f126])).
0.20/0.45	thf(f126,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = ((vAND @ (c @ X1)) @ (X1 @ (eps @ X1)))) | ($true = ((vAND @ (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))))) @ ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ (eps @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))))) )),
0.20/0.45	  inference(combinator_demodulation,[],[f125])).
0.20/0.45	thf(f125,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)) @ X1)) | ($true = (((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)) @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))) )),
0.20/0.45	  introduced(choice_axiom,[])).
0.20/0.45	thf(f115,plain,(
0.20/0.45	  ~spl0_4 | ~spl0_10),
0.20/0.45	  inference(avatar_contradiction_clause,[],[f114])).
0.20/0.45	thf(f114,plain,(
0.20/0.45	  $false | (~spl0_4 | ~spl0_10)),
0.20/0.45	  inference(trivial_inequality_removal,[],[f113])).
0.20/0.45	thf(f113,plain,(
0.20/0.45	  ($true = $false) | (~spl0_4 | ~spl0_10)),
0.20/0.45	  inference(backward_demodulation,[],[f54,f112])).
0.20/0.45	thf(f112,plain,(
0.20/0.45	  ( ! [X1 : $i] : (($false = (sK1 @ X1))) ) | ~spl0_10),
0.20/0.45	  inference(trivial_inequality_removal,[],[f111])).
0.20/0.45	thf(f111,plain,(
0.20/0.45	  ( ! [X1 : $i] : (($true = $false) | ($false = (sK1 @ X1))) ) | ~spl0_10),
0.20/0.45	  inference(forward_demodulation,[],[f110,f107])).
0.20/0.45	thf(f107,plain,(
0.20/0.45	  ($false = (sK1 @ (eps @ sK1))) | ~spl0_10),
0.20/0.45	  inference(avatar_component_clause,[],[f105])).
0.20/0.45	thf(f105,plain,(
0.20/0.45	  spl0_10 <=> ($false = (sK1 @ (eps @ sK1)))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_10])])).
0.20/0.45	thf(f110,plain,(
0.20/0.45	  ( ! [X1 : $i] : (($false = (sK1 @ X1)) | ($true = (sK1 @ (eps @ sK1)))) )),
0.20/0.45	  introduced(choice_axiom,[])).
0.20/0.45	thf(f54,plain,(
0.20/0.45	  ($true = (sK1 @ a)) | ~spl0_4),
0.20/0.45	  inference(avatar_component_clause,[],[f52])).
0.20/0.45	thf(f52,plain,(
0.20/0.45	  spl0_4 <=> ($true = (sK1 @ a))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
0.20/0.45	thf(f109,plain,(
0.20/0.45	  spl0_10 | ~spl0_5 | ~spl0_7),
0.20/0.45	  inference(avatar_split_clause,[],[f93,f73,f57,f105])).
0.20/0.45	thf(f57,plain,(
0.20/0.45	  spl0_5 <=> ($true = (c @ sK1))),
0.20/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl0_5])])).
0.20/0.45	thf(f93,plain,(
0.20/0.45	  ($false = (sK1 @ (eps @ sK1))) | (~spl0_5 | ~spl0_7)),
0.20/0.45	  inference(trivial_inequality_removal,[],[f91])).
0.20/0.45	thf(f91,plain,(
0.20/0.45	  ($true = $false) | ($false = (sK1 @ (eps @ sK1))) | (~spl0_5 | ~spl0_7)),
0.20/0.45	  inference(superposition,[],[f59,f74])).
0.20/0.45	thf(f74,plain,(
0.20/0.45	  ( ! [X1 : $i > $o] : (($false = (X1 @ (eps @ X1))) | ($false = (c @ X1))) ) | ~spl0_7),
0.20/0.45	  inference(avatar_component_clause,[],[f73])).
0.20/0.45	thf(f59,plain,(
0.20/0.45	  ($true = (c @ sK1)) | ~spl0_5),
0.20/0.45	  inference(avatar_component_clause,[],[f57])).
0.20/0.45	thf(f60,plain,(
0.20/0.45	  spl0_5),
0.20/0.45	  inference(avatar_split_clause,[],[f36,f57])).
0.20/0.45	thf(f36,plain,(
0.20/0.45	  ($true = (c @ sK1))),
0.20/0.45	  inference(binary_proxy_clausification,[],[f34])).
0.20/0.45	thf(f34,plain,(
0.20/0.45	  ($true = ((vAND @ (c @ sK1)) @ (sK1 @ a)))),
0.20/0.45	  inference(combinator_demodulation,[],[f33])).
0.20/0.45	thf(f33,plain,(
0.20/0.45	  ($true = (((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((cCOMB @ iCOMB) @ a)) @ sK1))),
0.20/0.45	  inference(sigma_clausification,[],[f32])).
0.20/0.45	thf(f32,plain,(
0.20/0.45	  ($true = (vSIGMA($i > $o) @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((cCOMB @ iCOMB) @ a))))),
0.20/0.45	  inference(combinator_demodulation,[],[f31])).
0.20/0.45	thf(f31,plain,(
0.20/0.45	  ($true = ((((bCOMB @ (bCOMB @ vSIGMA($i > $o))) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND)))) @ (cCOMB @ iCOMB))) @ c) @ a))),
0.20/0.45	  inference(definition_unfolding,[],[f29,f25])).
0.20/0.45	thf(f25,plain,(
0.20/0.45	  (setunion = ((bCOMB @ (bCOMB @ vSIGMA($i > $o))) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND)))) @ (cCOMB @ iCOMB))))),
0.20/0.45	  inference(cnf_transformation,[],[f12])).
0.20/0.45	thf(f12,plain,(
0.20/0.45	  (setunion = ((bCOMB @ (bCOMB @ vSIGMA($i > $o))) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND)))) @ (cCOMB @ iCOMB))))),
0.20/0.45	  inference(fool_elimination,[],[f11])).
0.20/0.45	thf(f11,plain,(
0.20/0.45	  (setunion = (^[X0 : ($i > $o) > $o, X1 : $i] : (? [X2 : $i > $o] : ((X2 @ X1) & (X0 @ X2)))))),
0.20/0.45	  inference(rectify,[],[f1])).
0.20/0.45	thf(f1,axiom,(
0.20/0.45	  (setunion = (^[X0 : ($i > $o) > $o, X1 : $i] : (? [X2 : $i > $o] : ((X2 @ X1) & (X0 @ X2)))))),
0.20/0.45	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setuniond)).
0.20/0.45	thf(f29,plain,(
0.20/0.45	  (((setunion @ c) @ a) = $true)),
0.20/0.45	  inference(cnf_transformation,[],[f20])).
0.20/0.45	thf(f20,plain,(
0.20/0.45	  (((setunion @ c) @ a) = $true)),
0.20/0.45	  inference(fool_elimination,[],[f19])).
0.20/0.45	thf(f19,plain,(
0.20/0.45	  ((setunion @ c) @ a)),
0.20/0.45	  inference(rectify,[],[f4])).
0.20/0.45	thf(f4,axiom,(
0.20/0.45	  ((setunion @ c) @ a)),
0.20/0.45	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ca)).
0.20/0.45	thf(f55,plain,(
0.20/0.45	  spl0_4),
0.20/0.45	  inference(avatar_split_clause,[],[f35,f52])).
0.20/0.45	thf(f35,plain,(
0.20/0.45	  ($true = (sK1 @ a))),
0.20/0.45	  inference(binary_proxy_clausification,[],[f34])).
0.20/0.45	thf(f50,plain,(
0.20/0.45	  ~spl0_2 | spl0_3),
0.20/0.45	  inference(avatar_split_clause,[],[f37,f48,f44])).
0.20/0.45	thf(f37,plain,(
0.20/0.45	  ( ! [X0 : $i] : (($true != ((epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps))) @ X0)) | ($true != (c @ (epsio @ ((sCOMB @ ((bCOMB @ vAND) @ c)) @ ((sCOMB @ iCOMB) @ eps)))))) )),
0.20/0.45	  inference(combinator_demodulation,[],[f30])).
0.20/0.45	thf(f30,plain,(
0.20/0.45	  ( ! [X0 : $i] : (($true != ((((bCOMB @ epsio) @ ((cCOMB @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND))) @ ((sCOMB @ iCOMB) @ eps))) @ c) @ X0)) | ($true != (c @ (((bCOMB @ epsio) @ ((cCOMB @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND))) @ ((sCOMB @ iCOMB) @ eps))) @ c)))) )),
0.20/0.45	  inference(definition_unfolding,[],[f24,f26,f26])).
0.20/0.45	thf(f26,plain,(
0.20/0.45	  (choosenonempty = ((bCOMB @ epsio) @ ((cCOMB @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND))) @ ((sCOMB @ iCOMB) @ eps))))),
0.20/0.45	  inference(cnf_transformation,[],[f14])).
0.20/0.45	thf(f14,plain,(
0.20/0.45	  (choosenonempty = ((bCOMB @ epsio) @ ((cCOMB @ ((bCOMB @ sCOMB) @ (bCOMB @ vAND))) @ ((sCOMB @ iCOMB) @ eps))))),
0.20/0.45	  inference(fool_elimination,[],[f13])).
0.20/0.45	thf(f13,plain,(
0.20/0.45	  (choosenonempty = (^[X0 : ($i > $o) > $o] : ((epsio @ (^[X1 : $i > $o] : ((X1 @ (eps @ X1)) & (X0 @ X1)))))))),
0.20/0.45	  inference(rectify,[],[f2])).
0.20/0.45	thf(f2,axiom,(
0.20/0.45	  (choosenonempty = (^[X0 : ($i > $o) > $o] : ((epsio @ (^[X2 : $i > $o] : ((X2 @ (eps @ X2)) & (X0 @ X2)))))))),
0.20/0.45	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choosenonemptyd)).
0.20/0.45	thf(f24,plain,(
0.20/0.45	  ( ! [X0 : $i] : (($true != ((choosenonempty @ c) @ X0)) | ((c @ (choosenonempty @ c)) != $true)) )),
0.20/0.45	  inference(cnf_transformation,[],[f21])).
0.20/0.45	thf(f21,plain,(
0.20/0.45	  ! [X0] : ($true != ((choosenonempty @ c) @ X0)) | ((c @ (choosenonempty @ c)) != $true)),
0.20/0.45	  inference(ennf_transformation,[],[f10])).
0.20/0.45	thf(f10,plain,(
0.20/0.45	  ~(? [X0] : ($true = ((choosenonempty @ c) @ X0)) & ((c @ (choosenonempty @ c)) = $true))),
0.20/0.45	  inference(fool_elimination,[],[f9])).
0.20/0.45	thf(f9,plain,(
0.20/0.45	  ~(? [X0] : ((choosenonempty @ c) @ X0) & (c @ (choosenonempty @ c)))),
0.20/0.45	  inference(rectify,[],[f7])).
0.20/0.45	thf(f7,negated_conjecture,(
0.20/0.45	  ~(? [X1] : ((choosenonempty @ c) @ X1) & (c @ (choosenonempty @ c)))),
0.20/0.45	  inference(negated_conjecture,[],[f6])).
0.20/0.45	thf(f6,conjecture,(
0.20/0.45	  ? [X1] : ((choosenonempty @ c) @ X1) & (c @ (choosenonempty @ c))),
0.20/0.45	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
0.20/0.45	% SZS output end Proof for theBenchmark
0.20/0.45	% (11324)------------------------------
0.20/0.45	% (11324)Version: Vampire 4.6.0 (commit 0afb7ed4a on 2021-06-23 15:27:21 +0100)
0.20/0.45	% (11324)Termination reason: Refutation
0.20/0.45	
0.20/0.45	% (11324)Memory used [KB]: 10490
0.20/0.45	% (11324)Time elapsed: 0.063 s
0.20/0.45	% (11324)------------------------------
0.20/0.45	% (11324)------------------------------
0.20/0.45	% (11314)Success in time 0.092 s
0.20/0.45	EOF